Morphological Operators characterized by neighborhood graphs
نویسندگان
چکیده
Mathematical Morphology is a theory that studies the decomposition of lattice operators in terms of some families of elementary lattice operators. When the lattices considered have a sup-generating family, the elementary operators can be characterized by structuring functions. The representation of structuring functions by neighborhood graphs is a powerful model for the construction of image operators. This model, that is a conceptual improvement of the one proposed by Vincent, permits a natural polymorphic extension of classical softwares for image processing by Mathematical Morphology. These systems constitute a complete framework for implementations of connected filters, that are one of the most modern and powerful approaches for image segmentation, and of operators that extract information from populations of objects in images. In this paper, besides presenting the formulation of the model, we present the polymorphic extension of a system for morphological image processing and some applications of it in image analysis.
منابع مشابه
Rough approximation operators based on quantale-valued fuzzy generalized neighborhood systems
Let $L$ be an integral and commutative quantale. In this paper, by fuzzifying the notion of generalized neighborhood systems, the notion of $L$-fuzzy generalized neighborhoodsystem is introduced and then a pair of lower and upperapproximation operators based on it are defined and discussed. It is proved that these approximation operators include generalized neighborhood system...
متن کاملAccurate Spatial Neighborhood Relationships for Arbitrarily-Shaped Objects Using Hamilton-Jacobi GVD
Many image segmentation approaches rely upon or are enhanced by using spatial relationship information between image regions and their object correspondences. Spatial relationships are usually captured in terms of relative neighborhood graphs such as the Delaunay graph. Neighborhood graphs capture information about which objects are close to each other in the plane or in space but may not captu...
متن کاملOn common neighborhood graphs II
Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.
متن کاملSpectra of some new extended corona
For two graphs $mathrm{G}$ and $mathrm{H}$ with $n$ and $m$ vertices, the corona $mathrm{G}circmathrm{H}$ of $mathrm{G}$ and $mathrm{H}$ is the graph obtained by taking one copy of $mathrm{G}$ and $n$ copies of $mathrm{H}$ and then joining the $i^{th}$ vertex of $mathrm{G}$ to every vertex in the $i^{th}$ copy of $mathrm{H}$. The neighborhood corona $mathrm{G}starmathrm{H}$ of $mathrm{G}$ and $...
متن کاملNon-Local Morphological PDEs and p-Laplacian Equation on Graphs With Applications in Image Processing and Machine Learning
In this paper, we introduce a new class of nonlocal p-Laplacian operators that interpolate between non-local Laplacian and infinity Laplacian. These operators are discrete analogous of the game p-laplacian operators on Euclidean spaces, and involve discrete morphological gradient on graphs. We study the Dirichlet problem associated with the new p-Laplacian equation and prove existence and uniqu...
متن کامل